ON THE ASYMPTOTIC BEHAVIOR OF HOPFIELD NEURAL NETWORK WITH PERIODIC INPUTS

ＩｎｔｒｏｄｕｃｔｉｏｎＳｉｎｃｅｔｈｅｓｐｅｃｉａｌｓｕｐｅｒｉｏｒｉｔｙｏｆａｒｔｉｆｉｃｉａｌｎｅｕｒａｌｎｅｔｗｏｒｋｓｔｅｃｈｎｏｌｏｇｙｉｎｖａｒｉｏｕｓｅｎｇｉｎｅｅｒｉｎｇｔｅｃｈｎｉｑｕｅｓｆｉｅｌｄｓ,ｓｕｃｈａｓｏｐｔｉｍｉｚａｔｉｏｎ ,ａｓｓｏｃｉａｔｉｖｅｍｅｍｏｒｉｅｓ,ｐａｔｔｅｒｎｒｅｃｏｇｎｉｔｉｏｎ ,ｓｉｇｎａｌｐｒｏｃｅｓｓｉｎｇａｎｄａｕｔｏｍａｔｉｃｃｏｎｔｒｏｌ,ｔｈｅｒｅｈａｓｂｅｅｎｉｎｃｒｅａｓｉｎｇｉｎｔｅｒｅｓｔｉｎｔｈｅｉｎｖｅｓｔｉｇａｔｉ…     

山地输电线动刚度计算及模态分析

为了揭示地形变化对连续档输电线动态特性的影响，本文提出了基于任意高差角的动刚度理论．首先将单档导线视为连续档导线的子结构，构建了两悬挂点不等高的单档导线振动方程，并在该理论方程中引入了二次项，能够考虑重力沿弦向分量的影响，推导出绝缘子串绕其悬挂点转动的动刚度计算方法，通过动刚度理论研究连续档导线横向振动模态和频率，并应用有限元软件ABAQUS 验证理论模态和频率公式的准确性．所得结果表明，动刚度的计算方法具有较高的精度，理论模态与有限元输出结果吻合较好，同时获得的频率和模态可为山地高压输电线路防舞技术的研究提供依据．     

Synthesis Optimization of Quaternized Chitosan and its Action as Reducing and Stabilizing Agent for Gold Nanoparticles

The optimal conditions for synthesizing quaternized chitosan (QCS) via microwave irradiation were explored. The microwave temperature, time, power, mole ratio between chitosan and 2,3-epoxypropyltrimethyl ammonium chloride (ETA), volume ratio between isopropanol and water, and pH value of the reaction system were studied to evaluate the effect on the degree of substitution (DS). The structure of QCS was characterized by means of FT-IR, NMR, XPS and XRD. TGA and DTG were used to measure its thermal stability. At last, QCS acted as a reducing and stabilizing agent to greenly synthesize gold nanoparticles without adding any other chemical reagent.     

主三镜一体化离轴三反光学天线设计

为提高空间激光通信离轴三反光学天线的装调效率,需要对反射镜总的装调自由度进行优化设计。基于共轴三反无焦系统的设计原理,提出一种主三镜一体化的设计方法,并推导了光学系统结构参数之间的关系,利用Zemax光学软件设计了一种结构紧凑、主三镜一体化的离轴三反光学天线。设计结果表明:全视场光学像质优于衍射极限,主镜和三镜空间位置相接近,可共母板加工和面形共基准检测,为主三镜的一体化加工提供了方法。光学天线的装调自由度减少了6个,降低了装调难度,提高了装调效率。     

Nonstationarity and related measures for time‐dependent hartree–fock and multiconfigurational models

Based on an earlier article (Eberly and Singh, Phys. Rev. D 1973 , 7, 359) and related works on short‐time evolution, this article proposes a many‐electron formulation for the nonstationarity degree which can be assigned to quantum system at each time point. The key measure introduced, , is a nonstationarity index that can be thought of as an inverse nominal lifetime at each instance of time. The index is directly computed from the time derivative of one‐electron density matrix and is a size‐consistent quantity. In this article, the approach is developed for the time‐dependent Hartree–Fock (TDHF), single‐excitation (TDCIS), and time‐dependent full configuration interaction (TDFCI) models. As a rule, nonstationarity effects are more pronounced in correlated electron systems, and a joint analysis of and the multiconfigurational character of wave functions apparently provide a deeper insight into dynamical molecular processes. The performed calculations on small molecules in laser fields show a preference for the TDCIS model when comparing TDCIS and TDHF with the “exact” TDFCI model. © 2013 Wiley Periodicals, Inc.     

A Mixture Model of Truncated Zeta Distributions with Applications to Scientific Collaboration Networks

The degree distribution has attracted considerable attention from network scientists in the last few decades to have knowledge of the topological structure of networks. It is widely acknowledged that many real networks have power-law degree distributions. However, the deviation from such a behavior often appears when the range of degrees is small. Even worse, the conventional employment of the continuous power-law distribution usually causes an inaccurate inference as the degree should be discrete-valued. To remedy these obstacles, we propose a finite mixture model of truncated zeta distributions for a broad range of degrees that disobeys a power-law behavior in the range of small degrees while maintaining the scale-free behavior. The maximum likelihood algorithm alongside the model selection method is presented to estimate model parameters and the number of mixture components. The validity of the suggested algorithm is evidenced by Monte Carlo simulations. We apply our method to five disciplines of scientific collaboration networks with remarkable interpretations. The proposed model outperforms the other alternatives in terms of the goodness-of-fit.     

Gallai’s path decomposition conjecture for graphs of small maximum degree

Gallai’s path decomposition conjecture states that the edges of any connected graph on $n$ vertices can be decomposed into at most $\frac{n+1}{2}$ paths. We confirm that conjecture for all graphs with maximum degree at most five.